The height of the mixed sparse resultant
نویسندگان
چکیده
منابع مشابه
An E cient Algorithm for the Sparse Mixed Resultant
We propose a compact formula for the mixed resultant of a system of n+1 sparse Laurent polynomials in n variables. Our approach is conceptually simple and geometric, in that it applies a mixed subdivision to the Minkowski Sum of the input Newton polytopes. It constructs a matrix whose determinant is a non-zero multiple of the resultant so that the latter can be de ned as the GCD of n + 1 such d...
متن کاملAn Efficient Algorithm for the Sparse Mixed Resultant
We propose a compact formula for the mixed resultant of a system of n+1 sparse Laurent polynomials in n variables. Our approach is conceptually simple and geometric, in that it applies a mixed subdivision to the Minkowski Sum of the input Newton polytopes. It constructs a matrix whose determinant is a non-zero multiple of the resultant so that the latter can be deened as the GCD of n + 1 such d...
متن کاملOn the Height of the Sylvester Resultant
X iv :m at h/ 03 10 27 6v 2 [ m at h. N T ] 1 3 M ay 2 00 4 ON THE HEIGHT OF THE SYLVESTER RESULTANT CARLOS D’ANDREA AND KEVIN G. HARE Abstract. Let n be a positive integer. We consider the Sylvester resultant of f and g, where f is a generic polynomial of degree 2 or 3 and g is a generic polynomial of degree n. If f is a quadratic polynomial, we find the resultant’s height. If f is a cubic pol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Mathematics
سال: 2004
ISSN: 1080-6377
DOI: 10.1353/ajm.2004.0050